Actively Secure Two-Party Computation: Efficient Beaver Triple Generation
نویسنده
چکیده
Author: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013 Supervisor: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013 Supervisor: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013 Instructor: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013 Allowed for defence Professor: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . " . . . . . " May 2013
منابع مشابه
Quorum-Based Secure Multi-party Computation
This paper describes efficient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to access structures based on quorum systems, which are collections of sets enjoying a naturallymotivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general,...
متن کاملFaster Secure Multi-party Computation of AES and DES Using Lookup Tables
We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party ‘TinyTable’ protocol of Damg̊ard et al. (ePrint 2016). Like TinyTable, an attractive feature of our protocol is a very fast and simple online evaluation phase. We also give a new method for efficiently implementing the preprocessing material required for the online...
متن کاملEfficient Constant Round Multi-party Computation Combining BMR and SPDZ
Recently, there has been huge progress in the field of concretely efficient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the twoparty setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely efficient fully-secure protocols, such as SPD...
متن کاملSecure Multi-Party Computation (Excerpts of Chapter 2)
3 Secure Multi-Party Computation 2 3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.1.1 Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.1.2 Security Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Passively Secure Multi-Party Computation . . . . . . . . . . . . . . . . . . . ...
متن کاملAuthenticated Garbling and Efficient Maliciously Secure Multi-Party Computation
In this paper, we extend the recent work by Wang et al., who proposed a new framework for secure two-party computation in the preprocessing model that can be instantiated efficiently using TinyOT. We show that their protocol can be generalized to the multi-party setting, where the preprocessing functionality is based on the multi-party TinyOT-like protocol. Assuming there are n parties where at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013